搜索资源列表
NQueen
- 可以求解N皇后问题，用的也是王晓东的书上讲的方法！希望对大家有些用处！-Using this codes you can solve n-!Queens problem！
nqueens.tar
- N皇后问题的所有解演示，用Qt做的-N-Queens problem all solutions demonstrate, to do with Qt. . . . . . . . . . . . .
2
- N皇后问题，递归实现，适合初学算法的同学，希望能对你们有所帮助-N-Queens problem, recursive, algorithm suitable for beginner students, I hope you can help
8
- 8皇后的C#实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.-8 Queen' s C# implementation, you can customize the number of input Queen, and the N-smart
n_queen
- 关于N皇后问题,通过探讨N后问题得到一些结论性的东西-On the N-Queens problem, after problem by exploring some of the conclusions N of the things
NQueen
- 本程序由八皇后问题出发，为解决N皇后问题。本程序是跨平台设计,由宏UNIX选择是UNIX还是WIN 。-The procedure starting from the eight queens problem, to solve N-Queens problem. The program is cross-platform design, the choice is UNIX or UNIX macro WIN.
GA_NQueen
- 遗传算法解决N皇后问题，并经过一些优化，得到了较好的效果-Genetic algorithm to solve N-Queens problem, and after some optimization to get good results
NQueen_bit
- N皇后问题的一种简单解法，利用位运算来解决，当N较大时，能有效算出解法的种数。-N-Queens problem is a simple solution, the use of bit operations to solve, when N is large, it can effectively calculate the solution of the species.
nQueen
- 在n*n的棋盘上放置n个皇后，要求皇后两两互斥，即任意两个皇后不能出现在同一行、同一列或同一条斜对角线上。试求出所有的合法布局-In the n* n chessboard placed on the n Queens, asked the Queen twenty-two mutually exclusive, that is, any two queens can not appear on the same line, same column, or diagonal line with
NQueen
- n-皇后问题的迭代回溯解法，里面是完整的程序。可以运行。本人亲写。-n-queens problem iterative back solution, which is a complete program. Can run. I am pro-write.
bahuanghou
- 利用递归方法来求解著名的八皇后问题，还可以拓展求n皇后问题-Well-known recursive method to solve the eight queens problem, you can also expand the demand n-queens problem
N-Queens-Genetic-Algorithm
- 8queens Algorithm This is not mine so I don t take credit for it. It helped me with my backtracking method and it would help anyone.
N-HuangHou
- 主要内容 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-Main content of eight queens problem is an ancient and well-known probl
nQueen
- 实现解决N皇后的问题，由用户指定N，程序给出所有摆法的情况及摆法数目-Achieve a solution N-Queens problem, the user-specified N, the program gives all the pendulum method the number of conditions and the pendulum method
n_Queen
- 该算法为回溯法的经典问题之一，在n*n的棋盘上放置n个皇后。运行后会给出皇后的位置和解的个数-The backtracking algorithm is one of the classic problems in the n* n place n queens on the chessboard. After running the settlement will give the location of the number of Queen s
nQueens
- 关于N皇后C++程序，这个程序运用了启发式搜索-heuristic search about n queens using C++
nQueen
- n Queens problem solution using backtracking programing
moama
- arranging n queens on an n*n board
nqueensja
- n queens problem solved in java
NQueen
- N皇后的经典问题解决方案.用一维数组解决.-The classic N-Queens problem solution to solve one-dimensional array